A Brief Introduction to Hamilton Cycles in Random Graphs
نویسنده
چکیده
We survey results concerning Hamilton cycles in random graphs. Specifically, we focus on existence results for general and regular graphs, and discuss algorithms for finding Hamilton cycles and solving related problems (that succeed with high probability).
منابع مشابه
On covering expander graphs by hamilton cycles
The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum degree ∆ satisfies some basic expansion properties and contains a family of (1−o(1))∆/2 edge disjoint Hamilton cycles, then there also exists a covering of its...
متن کاملPacking, Counting and Covering Hamilton cycles in random directed graphs
A Hamilton cycle in a digraph is a cycle passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of the main reasons for this, is that there is no general tool for finding Hamilton cycles in directed graphs comparable to the so called Posá ‘rotationextension’ te...
متن کاملCounting the Number of Hamilton Cycles in Random Digraphs
We show that there exists a a fully polynomial randomized approximation scheme for counting the number of Hamilton cycles in almost all directed graphs.
متن کاملOn the Number of Hamilton Cycles in Sparse Random Graphs
We prove that the number of Hamilton cycles in the random graph G(n, p) is n!p(1 + o(1)) a.a.s., provided that p ≥ ln n+ln ln n+ω(1) n . Furthermore, we prove the hitting-time version of this statement, showing that in the random graph process, the edge that creates a graph of minimum degree 2 creates ( ln n e )n (1+o(1)) Hamilton cycles a.a.s.
متن کاملHamilton decompositions of regular expanders: Applications
In a recent paper, we showed that every sufficiently large regular digraph G on n vertices whose degree is linear in n and which is a robust outexpander has a decomposition into edge-disjoint Hamilton cycles. The main consequence of this theorem is that every regular tournament on n vertices can be decomposed into (n − 1)/2 edge-disjoint Hamilton cycles, whenever n is sufficiently large. This v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005